Complete Sets of Transformations for General E-Unification
نویسندگان
چکیده
This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems of terms, developed by Martelli-Montanari for standard unification, to Eunification by giving two sets of transformations, BT and T, which are proved to be sound and complete in the sense that a complete set of E-unifiers for any equational theory E can be enumerated by either of these sets. The set T is an improvement of BT, in that many E-unifiers produced by BT will be weeded out by T. In addition, we show that a generalization of surreduction (also called narrowing) combined with the computation of critical pairs is complete. A new representation of equational proofs as certain kinds of trees is used to prove the completeness of the set BT in a rather direct fashion that parallels the completeness of the transformations in the case of (standard) unification. The completeness of T and the generalization of surreduction is proved by a method inspired by the concept of unfailing completion, using an abstract (and simpler) notion of the completion of a set of equations. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-89-12. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/779 COMPLETE SETS OF TRANSFORMATIONS FOR GENERAL E-UNIFICATION Jean H. Gallier and Wayne Snyder MS-CIS-89-12 LOGIC & COMPUTATION 03 Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104 (Revised February 1989) To appear In special Issue of "Theoretical Computer Science" (1988) Acknowledgements: This research was supported in part by NSF grants DCR 86-07156, MCS-8219196-CER, IR184-10413-A02 and U.S. Army grants DAA29-84-K-0061, DAA29-84-9-0027. COMPLETE SETS OF TRANSFORMATIONS FOR GENERAL E-UNIFICATION Jean H. Gallier and Wayne Snyder Department of Computer and Information Science University of Pennsylvania Philadelphia, Pa 19104
منابع مشابه
Higher-Order Unification Revisited: Complete Sets of Transformations
In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of transformations on systems of terms which has its roots in Herbrand’s thesis, and which was developed by Martelli and Montanari in the context of first-order unification. This method provides an abstract and mathematically elegant means of analyzing the invariant properties...
متن کاملOperads of higher transformations for globular sets and for higher magmas
In this article we discuss examples of fractal $omega$-operads. Thus we show that there is an $omega$-operadic approach to explain existence of the globular set of globular setsfootnote{Globular sets are also called $omega$-graphs by the French School.}, the reflexive globular set of reflexive globular sets, the $omega$-magma of $omega$-magmas, and also the reflexive $omega$-magma ...
متن کاملAn Improved General E-Unification Method
A generalization of Paramodulation is deened and shown to lead to a complete E-uniication method for arbitrary equational theories E. The method is deened in terms of transformations on systems, building upon and reening results of Gallier and Snyder.
متن کاملTowards Correctness of Program Transformations Through Unification and Critical Pair Computation
Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of...
متن کاملUnification procedures in automated deduction methods based on matings: A survey
Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Gödel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transforma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 67 شماره
صفحات -
تاریخ انتشار 1989